On Robust Colorings of Hamming-Distance Graphs
نویسندگان
چکیده
منابع مشابه
On Robust Colorings of Hamming-Distance Graphs
Hq(n, d) is defined as the graph with vertex set Zq and where two vertices are adjacent if their Hamming distance is at least d. The chromatic number of these graphs is presented for various sets of parameters (q, n, d). For the 4-colorings of the graphs H2(n, n − 1) a notion of robustness is introduced. It is based on the tolerance of swapping colors along an edge without destroying properness...
متن کاملDISTANCE k COLORINGS OF HAMMING GRAPHS
A coloring of the vertices of a graph G is a distance k coloring of G if and only if any two vertices lying on a path of length less than or equal to k are given different colors. Hamming graphs are Cartesian (or box) products of complete graphs. In this paper, we will consider the interaction between coding theory and distance k colorings of Hamming graphs.
متن کاملOn Packing Colorings of Distance Graphs
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کامل2-Distance Colorings of Integer Distance Graphs
A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1, . . . , k} such that every two vertices at distance at most 2 receive distinct colors. The 2-distance chromatic number χ2(G) of G is then the mallest k for which G admits a 2-distance k-coloring. For any finite set of positive integers D = {d1, . . . , dk}, the integer distance graph G = G(D) is the infinite g...
متن کاملDistance-two labellings of Hamming graphs
Let j ≥ k ≥ 0 be integers. An `-L(j, k)-labelling of a graph G = (V , E) is a mapping φ : V → {0, 1, 2, . . . , `} such that |φ(u)−φ(v)| ≥ j if u, v are adjacent and |φ(u)−φ(v)| ≥ k if they are distance two apart. Let λj,k(G) be the smallest integer ` such that G admits an `-L(j, k)-labelling. Define λj,k(G) to be the smallest ` if G admits an `-L(j, k)-labelling with φ(V ) = {0, 1, 2, . . . , ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/6495